Searchable Encryption with Access Control on Keywords in Multi-User Setting
نویسندگان
چکیده
منابع مشابه
Searchable Encryption with Access Control ∗ Nils Löken
Outsourcing data to the cloud is becoming increasingly prevalent. To ensure data confidentiality, encrypting the data before outsourcing it is advised. While encryption protects the secrets in the data, it also prevents operations on the data. For example in a multi-user setting, data is often accessed via search, but encryption prevents search. Searchable encryption solves this dilemma. Howeve...
متن کاملMulti-user Searchable Encryption in the Cloud
While Searchable Encryption (SE) has been widely studied, adapting it to the multi-user setting whereby many users can upload secret files or documents and delegate search operations to multiple other users still remains an interesting problem. In this paper we show that the adversarial models used in existing multi-user searchable encryption solutions are not realistic as they implicitly requi...
متن کاملMulti-level Access in Searchable Symmetric Encryption
Remote storage delivers a cost effective solution for data storage. If data is of a sensitive nature, it should be encrypted prior to outsourcing to ensure confidentiality; however, searching then becomes challenging. Searchable encryption is a well-studied solution to this problem. Many schemes only consider the scenario where users can search over the entirety of the encrypted data. In practi...
متن کاملPublic Key Encryption with Searchable Keywords Based on Jacobi Symbols
Vishal Saraswat (CRRao AIMSCS) Searchable Encryption APHRDI, 22/09/16 10 / 46 Vishal Saraswat Some other projects Abstract Public-key encryption with keyword search (PEKS) schemes are useful to delegate searching capabilities on encrypted data to a third party, who does not hold the entire secret key, but only an appropriate token which allows searching operations but preserves data privacy. PE...
متن کاملSearchable Public Key Encryption Based on RSA Assumption and Extended to Multi-user Setting
In this paper, we study the problem of keyword searches over asymmetrically encrypted data. Our scheme is based on strong RSA assumption, which provides the high efficient search technique and is proven secure in the standard model. In comparison with previous schemes, our scheme requires only simpler computation without pairing operation, and lower storage overheads on servers and clients. Mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cyber Security
سال: 2020
ISSN: 2579-0064
DOI: 10.32604/jcs.2020.06313